Two approaches for fixed-point filter design: "bit-flipping" algorithm and constrained downhill simplex method
نویسندگان
چکیده
This paper presents two techniques for the design of digital filters with wordlength-constrained coefficients, the bit-flipping algorithm improved since it was first presented in [l] and the Downhill Simplex Method [2] modified to deliver fixed-point filter coefficients. Both techniques can be applied to design of filter coefficients from scratch or to the optimisation of their floatingpoint versions. Both methods presented in this paper have been tested on the two-path polyphase half-band lowpass filter design problem. However, both these techniques can be used with almost no alteration, for general constrained coefficient digital design.
منابع مشابه
Analysis of the Polyphase Iir Structure in the Constraint Coefficient Space
This paper presents two techniques for the design of digital filters with bit-constrained coefficients, the “bit-flipping” algorithm [1] and the Downhill Simplex Method modified to deliver fixedpoint filter coefficients [2]. Both techniques can be applied both to design filters from scratch and to optimise their floating-point equivalents. They are comparatively presented through an example of ...
متن کاملConstraint two-path polyphase IIR filter design using downhill simplex algorithm
The paper addresses tlie design of tlie polyphase IIR filters based on the “’-order single-coefficient allpass sub-filters in the constraint coefficient space using the Constraint Dowdiill Simplex Algorithm. Incorporating the bit-flipping algorithm into its core engine allowed the optitilisation routine to converge to better target designs without affecting tlie Iiigli speed of tlie original al...
متن کاملAugmented Downhill Simplex a Modified Heuristic Optimization Method
Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل